منابع مشابه
Weighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملطراحی یک مدل چندگانه (multiple model) برای توربین گازی v94.2 زیمنس در شرایط با خطاو سالم
به دلیل آن که استخراج مدل ریاضی از فرآیندهای صنعتی، دارای پیچیدگی های فراوانی است، مدل سازی بر اساس داده های ورودی و خروجی مورد استقبال بیشتری قرار گرفته است. از طرفی توجه به اصل سادگی، منجر به استفاده از ساختار مدل های چندگانه شده است. از این رو، در این پایان نامه سیستم تشخیص عیب مبتنی بر مدل های چندگانه مدنظر قرار گرفت. با استفاده از شناساگر عصبی-فازیِ محلی-خطی، بانک های مدل برای تمامیِ شرایط س...
Enhancing Multiple - Path
Speculative execution has long been used as an approach to exploit instruction level par-allelism across basic block boundaries. Most existing speculative execution techniques only support speculating along single control path, and heavily rely on branch prediction to choose the right control path. In this paper, we propose an extended predicated execution mechanism, called predicate shifting, ...
متن کاملThe path to damage in multiple sclerosis.
For several decades students of multiple sclerosis (MS) have generally accepted the cause of the MS lesion as being entirely T cell mediated. More recently, however, numerous reports of studies of the animal model, experimental allergic encephalomyelitis (EAE), and detailed analysis of the pathology of MS have indicated that the events involved in the MS lesion may be more complicated. In this ...
متن کاملAngle constrained path to cluster multiple manifolds
In this paper, we propose a method to cluster multiple intersected manifolds. The algorithm chooses several landmark nodes randomly and then checks whether there is an angle-constrained path between each landmark node and every other node in the neighborhood graph. When the points lie on different manifolds with intersection they should not be connected using a smooth path, thus the angle const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2021
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0247722